Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
نویسندگان
چکیده
منابع مشابه
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games
Monte Carlo Tree Search (MCTS) has recently been successfully used to create strategies for playing imperfect-information games. Despite its popularity, there are no theoretic results that guarantee its convergence to a well-defined solution, such as Nash equilibrium, in these games. We partially fill this gap by analysing MCTS in the class of zero-sum extensive-form games with simultaneous mov...
متن کاملConvergence of Monte Carlo Tree Search in Simultaneous Move Games
We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is -Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS a...
متن کاملMonte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel
Monte Carlo Tree Search (MCTS) has become a widely popular sampled-based search algorithm for two-player games with perfect information. When actions are chosen simultaneously, players may need to mix between their strategies. In this paper, we discuss the adaptation of MCTS to simultaneous move games. We introduce a new algorithm, Online Outcome Sampling (OOS), that approaches a Nash equilibri...
متن کاملCooperative Games with Monte Carlo Tree Search
Monte Carlo Tree Search approach with Pareto optimality and pocket algorithm is used to solve and optimize the multi-objective constraint-based staff scheduling problem. The proposed approach has a two-stage selection strategy and the experimental results show that the approach is able to produce solutions for cooperative games.
متن کاملRevisiting Move Groups in Monte-Carlo Tree Search
The UCT (Upper Confidence Bounds applied to Trees) algorithm has allowed for significant improvements in a number of games, most notably the game of Go. Move groups is a modification that greatly reduces the branching factor at the cost of increased search depth and as such may be used to enhance the performance of UCT. From the results of the experiments, we conclude the general structure of g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2019
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-019-05832-z